#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
    int n; cin >> n;
    vector<int> arr(n);
    for (auto& e : arr) cin >> e;
    int tmp, jug = 0;
    while (cin >> tmp)
    {
        if (jug) cout << endl; jug = 1;
        int pos = find(arr.begin(), arr.end(), tmp) - arr.begin();
        if (pos == arr.size()) cout << "no";
        else cout << pos + 1;
    }
    return 0;
}